Error bounds for linear complementarity problems of DB-matrices
نویسندگان
چکیده
منابع مشابه
Computation of Error Bounds for P-matrix Linear Complementarity Problems
We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix linear interval system. Moreover, for the involved matrix being an H-matrix with positive diagonals, an error bound can be found by solving a linear system of equations, which is sharper than the Mathias-Pang error bound. Pre...
متن کاملError bounds for linear complementarity problems of weakly chained diagonally dominant B-matrices
In this paper, new error bounds for the linear complementarity problem are obtained when the involved matrix is a weakly chained diagonally dominant B-matrix. The proposed error bounds are better than some existing results. The advantages of the results obtained are illustrated by numerical examples.
متن کاملError bounds for symmetric cone complementarity problems
In this paper, we investigate the issue of error bounds for symmetric cone complementarity problems (SCCPs). In particular, we show that the distance between an arbitrary point in Euclidean Jordan algebra and the solution set of the symmetric cone complementarity problem can be bounded above by some merit functions such as FischerBurmeister merit function, the natural residual function and the ...
متن کاملP D - Matrices and Linear Complementarity Problems
Motivated by the definition of P†-matrix ([9]), another generalization of a P -matrix for square singular matrices called PD-matrix is proposed first. Then the uniqueness of solution of Linear Complementarity Problems for square singular matrices is proved using PD-matrices. Finally some results which are true for P -matrices are extended to PD-matrices.
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2011
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.09.049